Multiple Message Broadcasting wiht Generalized Fibonacci Trees
نویسندگان
چکیده
We present efficient algorithms for broadcasting multiple messages. We assume n processors, one of which contains m packets that it must broadcast to each of the remaining n 1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. We give a broadcasting algorithm which requires m + log n + 310g log n + 15 rounds. In addition, we show a simple lower bound of m + pog n11 rounds for broadcasting in this model.
منابع مشابه
Coupled Sequences of Generalized Fibonacci Trees and Unequal Costs Coding Problems
Fibonacci trees and generalized Fibonacci trees have been defined and studied by Horibe [4], Chang [2], and the author [1]. The k^ tree in the sequence of r-ary generalized Fibonacci trees, T(k), has T(k-c(i)) as the I leftmost subtree descending from its root node for k>r, and T(k) consists of a single root node for k-\ ...,r. Here c(i), z' = l,...,r, are positive integers with greatest common...
متن کاملNonexhaustive Generalized Fibonacci Trees in Unequal Costs Coding Problems
In a sequence of generalized Fibonacci trees, the kth tree has the (k c(i))th tree as its ith subtree for a nondecreasing sequence of positive integers c(i), i = 1; :::; r. For particular initializations, each tree in the generalized Fibonacci sequence solves a minimax coding problem related to Varn coding. Speci cally, each symbol from a uniformly distributed source is to be encoded by a strin...
متن کاملA Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملBroadcasting with Many Faulty Links
We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total...
متن کامل